|
In mathematical logic, a definable set is an ''n''-ary relation on the domain of a structure whose elements are precisely those elements satisfying some formula in the language of that structure. A set can be defined with or without parameters, which are elements of the domain that can be referenced in the formula defining the relation. == Definition == Let be a first-order language, an -structure with domain , a fixed subset of , and a natural number. Then: * A set is ''definable in with parameters from '' if and only if there exists a formula and elements such that for all , : if and only if :The bracket notation here indicates the semantic evaluation of the free variables in the formula. * A set '' is definable in without parameters'' if it is definable in with parameters from the empty set (that is, with no parameters in the defining formula). * A function is definable in (with parameters) if its graph is definable (with those parameters) in . * An element is definable in (with parameters) if the singleton set is definable in (with those parameters). 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Definable set」の詳細全文を読む スポンサード リンク
|